Distributed computing of efficient routing schemes in generalized chordal graphs
نویسندگان
چکیده
منابع مشابه
Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs
Efficient algorithms for computing routing tables should take advantage of the particular properties arising in large scale networks. There are in fact at least two properties that any routing scheme must consider: low (logarithmic) diameter and high clustering coefficient. High clustering coefficient implies the existence of few large induced cycles. Therefore, we propose a routing scheme that...
متن کاملCompact Routing Schemes for Generalised Chordal Graphs
In this paper, we show how to use the notion of layering-tree introduced in [5], in order to obtain polynomial time constructible routing schemes. We describe efficient routing schemes for two classes of graphs that include the class of chordal graphs. For k-chordal graphs, i.e., graphs containing no induced cycle of length greater than k, the routing scheme uses addresses and local memories of...
متن کاملcoordination of protective schemes in distribution and subtransmission systems including distributed generation
نصب منابع پراکنده در سیستم های توزیع و فوق توزیع علاوه بر مزیت های فراوان، مشکلاتی را هم به همراه دارد. یکی از این مشکلات تأثیر این منابع روی اندازه جریان های اتصال کوتاه است. به طور معمول از حفاظت های مبتنی بر اصل جریان زیاد در سیستم های توزیع و فوق توزیع استفاده می شود. از مهمترین طرح های حفاظتی استفاده شده در فیدرهای توزیع، حفاظت فیوز- ریکلوزر است. همچنین از طرح های حفاظتی جریان زیاد جهتی در...
Complexity of Generalized Colourings of Chordal Graphs
The generalized graph colouring problem (GCOL) for a fixed integer k, and fixed classes of graphs P1, . . . ,Pk (usually describing some common graph properties), is to decide, for a given graph G, whether the vertex set of G can be partitioned into sets V1, . . . , Vk such that, for each i, the induced subgraph of G on Vi belongs to Pi. It can be seen that GCOL generalizes many natural colouri...
متن کاملGeneralized clique coverings of chordal graphs
Two main types 1)£ clique coveri cd phs ha'J(? d j,scussed. One is ali que c C) v p r i r, 9 Cl f \! l-''', ice S , a set ,-, f clIques which between them contain eve! 'JI? te:,c at once. The other, a clique c:-overing of edgEs, is a set f cliques which between them contain eVPIY e0ge. CllVering of edges may be deflned as a lique covering of vertices with the added rest iction hat tho=> I:'"nds...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.01.006